Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle
نویسندگان
چکیده
Given a set of n colored points with a total of m > 3 colors in 2D, the problem of identifying the smallest color-spanning object is studied. We have considered two different shapes: (i) corridor, and (ii) rectangle of arbitrary orientation. Our proposed algorithm identifies the narrowest color-spanning corridor in O(n2 log n) time using O(n) space. Our proposed algorithm for identifying minimum area color-spanning rectangle runs in O(n3 log m) time and O(n) space.
منابع مشابه
Color Spanning Annulus: Square, Rectangle and Equilateral Triangle
In this paper, we study different variations of minimum width color-spanning annulus problem among a set of points P = {p1, p2, . . . , pn} in IR, where each point is assigned with a color in {1, 2, . . . , k}. We present algorithms for finding a minimum width color-spanning axis parallel square annulus (CSSA), minimum width color spanning axis parallel rectangular annulus (CSRA), and minimum w...
متن کاملRheinische Friedrich - Wilhelms - Universität Bonn
Given n point sites in the plane each painted in one of k colors, the region of a c-colored site p in the Farthest Color Voronoi Diagram (FCVD) contains all points of the plane for which c is the farthest color and p the nearest c-colored site. This novel structure generalizes both the standard Voronoi diagram (k = 1) and the farthest site Voronoi diagram (k = n). We show that the FCVD has stru...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملSpectral-spatial classification of hyperspectral images by combining hierarchical and marker-based Minimum Spanning Forest algorithms
Many researches have demonstrated that the spatial information can play an important role in the classification of hyperspectral imagery. This study proposes a modified spectral–spatial classification approach for improving the spectral–spatial classification of hyperspectral images. In the proposed method ten spatial/texture features, using mean, standard deviation, contrast, homogeneity, corr...
متن کاملMinimum vertex ranking spanning tree problem for chordal and proper interval graphs
A vertex k-ranking of a simple graph is a coloring of its vertices with k colors in such a way that each path connecting two vertices of the same color contains a vertex with a bigger color. Consider the minimum vertex ranking spanning tree (MVRST) problem where the goal is to find a spanning tree of a given graph G which has a vertex ranking using the minimal number of colors over vertex ranki...
متن کامل